Haitner, Iftach: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function

Haitner, Iftach, Nguyen, Minh-Huyen, Ong, Shien Jin, Reingold, Omer, Vadhan, Salil

Journal:

SIAM Journal on Computing

Year:

2009

Language:

english

File:

PDF, 722 KB

english, 2009

2

Limits on the Usefulness of Random Oracles

Haitner, Iftach, Omri, Eran, Zarosim, Hila

Journal:

Journal of Cryptology

Year:

2016

Language:

english

File:

PDF, 581 KB

english, 2016

3

[IEEE 2010 IEEE 25th Annual Conference on Computational Complexity (CCC) - Cambridge, MA, USA (2010.06.9-2010.06.12)] 2010 IEEE 25th Annual Conference on Computational Complexity - A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP

Haitner, Iftach, Mahmoody, Mohammad, Xiao, David

Year:

2010

Language:

english

File:

PDF, 394 KB

english, 2010

4

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

Haitner, Iftach, Hoch, Jonathan J., Reingold, Omer, Segev, Gil

Year:

2007

Language:

english

File:

PDF, 294 KB

english, 2007

5

[IEEE 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) - Paris (2018.10.7-2018.10.9)] 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) - Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling

Beimel, Amos, Haitner, Iftach, Makriyannis, Nikolaos, Omri, Eran

Year:

2018

Language:

english

File:

PDF, 281 KB

english, 2018

6

Black-Box Constructions of Protocols for Secure Computation

Haitner, Iftach, Ishai, Yuval, Kushilevitz, Eyal, Lindell, Yehuda, Petrank, Erez

Journal:

SIAM Journal on Computing

Year:

2011

Language:

english

File:

PDF, 466 KB

english, 2011

7

Coin Flipping with Constant Bias Implies One-Way Functions

Haitner, Iftach, Omri, Eran

Journal:

SIAM Journal on Computing

Year:

2014

Language:

english

File:

PDF, 300 KB

english, 2014

8

[ACM Press the 41st annual ACM symposium - Bethesda, MD, USA (2009.05.31-2009.06.02)] Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 - Inaccessible entropy

Haitner, Iftach, Reingold, Omer, Vadhan, Salil, Wee, Hoeteck

Year:

2009

Language:

english

File:

PDF, 449 KB

english, 2009

9

Characterization of Secure Multiparty Computation Without Broadcast

Cohen, Ran, Haitner, Iftach, Omri, Eran, Rotem, Lior

Journal:

Journal of Cryptology

Year:

2017

Language:

english

File:

PDF, 551 KB

english, 2017

10

A New Interactive Hashing Theorem

Iftach Haitner, Omer Reingold

Journal:

Journal of Cryptology

Year:

2014

Language:

english

File:

PDF, 493 KB

english, 2014

11

From Non-adaptive to Adaptive Pseudorandom Functions

Berman, Itay, Haitner, Iftach

Journal:

Journal of Cryptology

Year:

2015

Language:

english

File:

PDF, 348 KB

english, 2015

12

On the Power of the Randomized Iterate

Haitner, Iftach, Harnik, Danny, Reingold, Omer

Journal:

SIAM Journal on Computing

Year:

2011

Language:

english

File:

PDF, 522 KB

english, 2011

13

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Coin Flipping with Constant Bias Implies One-Way Functions

Haitner, Iftach, Omri, Eran

Year:

2011

Language:

english

File:

PDF, 479 KB

english, 2011

14

[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Efficiency improvements in constructing pseudorandom generators from one-way functions

Haitner, Iftach, Reingold, Omer, Vadhan, Salil

Year:

2010

Language:

english

File:

PDF, 511 KB

english, 2010

15

Coin Flipping of Any Constant Bias Implies One-Way Functions

Berman, Itay, Haitner, Iftach, Tentes, Aris

Journal:

Journal of the ACM

Year:

2018

Language:

english

File:

PDF, 1.51 MB

english, 2018

16

Reducing Complexity Assumptions for

Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel

Journal:

Journal of Cryptology

Year:

2009

Language:

english

File:

PDF, 431 KB

english, 2009

17

[IEEE Twenty-Second Annual IEEE Conference on Computational Complexity - San Diego, CA, USA (2007.06.13-2007.03.16)] Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) - A New Interactive Hashing Theorem

Haitner, Iftach, Reingold, Omer

Year:

2007

Language:

english

File:

PDF, 280 KB

english, 2007

18

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

Haitner, Iftach, Hoch, Jonathan J., Reingold, Omer, Segev, Gil

Year:

2007

Language:

english

File:

PDF, 294 KB

english, 2007

19

Hardness-Preserving Reductions via Cuckoo Hashing

Berman, Itay, Haitner, Iftach, Komargodski, Ilan, Naor, Moni

Journal:

Journal of Cryptology

Year:

2018

Language:

english

File:

PDF, 1.03 MB

english, 2018

20

Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

Haitner, Iftach, Hoch, Jonathan J., Reingold, Omer, Segev, Gil

Journal:

SIAM Journal on Computing

Year:

2015

Language:

english

File:

PDF, 543 KB

english, 2015

21

[IEEE 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) - Paris, France (2018.10.7-2018.10.9)] 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) - Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Haitner, Iftach, Nissim, Kobbi, Omri, Eran, Shaltiel, Ronen, Silbak, Jad

Year:

2018

Language:

english

File:

PDF, 251 KB

english, 2018

22

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Haitner, Iftach, Nissim, Kobbi, Omri, Eran, Shaltiel, Ronen, Silbak, Jad

Journal:

SIAM Journal on Computing

Year:

2020

File:

PDF, 567 KB

2020

23

An Almost-Optimally Fair Three-Party Coin-Flipping Protocol

Haitner, Iftach, Tsfadia, Eliad

Journal:

SIAM Journal on Computing

Year:

2017

Language:

english

File:

PDF, 842 KB

english, 2017

24

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - A Parallel Repetition Theorem for Any Interactive Argument

Haitner, Iftach

Year:

2009

Language:

english

File:

PDF, 313 KB

english, 2009

25

A Parallel Repetition Theorem for Any Interactive Argument

Haitner, Iftach

Journal:

SIAM Journal on Computing

Year:

2013

Language:

english

File:

PDF, 221 KB

english, 2013

26

[ACM Press the thirty-ninth annual ACM symposium - San Diego, California, USA (2007.06.11-2007.06.13)] Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 - Statistically-hiding commitment from any one-way function

Haitner, Iftach, Reingold, Omer

Year:

2007

Language:

english

File:

PDF, 266 KB

english, 2007

27

Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions

Haitner, Iftach, Reingold, Omer, Vadhan, Salil

Journal:

SIAM Journal on Computing

Year:

2013

Language:

english

File:

PDF, 353 KB

english, 2013

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски